Comparing Expressiveness of Set Constructor Symbols
نویسندگان
چکیده
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove that they are not mutually expressible by means of existentially quantified formulae. In order to prove our results, canonical forms for set-theoretic and multiset-theoretic formulae are established and a particularly natural axiomatization of multisets is given and studied.
منابع مشابه
Comparing the Expressiveness of Description Logics
This work studies the expressiveness of the description logics that extend ALCreg (a variant of PDL) with any combination of the features: inverse roles, nominals, quantified number restrictions, the universal role, the concept constructor for expressing the local reflexivity of a role. We compare the expressiveness of these description logics w.r.t. concepts, positive concepts, TBoxes and ABox...
متن کاملComparing spiritual intelligence and emotional expressiveness in psychosomatic patients
The most important issues of psychology is psychosomatic disease. This study aimed to compare spiritual intelligence and emotional expression in patients with irritable bowel syndrome, coronary heart disease and asthma. This research was a post-event descriptive study. The statistical population included patients with coronary heart disease, irritable bowel syndrome and asthma that attended Ima...
متن کاملSyntactic Connuence Criteria for Positive/negative-conditional Term Rewriting Systems
We study the combination of the following already known ideas for showing connuence of unconditional or conditional term rewriting systems into practically more useful connuence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet's introduction and Toyama's generalization of parallel closedness for non-noetherian unconditional systems, t...
متن کاملSyntactic Confluence Criteria for Positive/Negative-Conditional Term Rewriting Systems
We study the combination of the following already known ideas for showing confluence of unconditional or conditional term rewriting systems into practically more useful confluence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet’s introduction and Toyama’s generalization of parallel closedness for non-terminating unconditional systems...
متن کاملTarskian Set Constraints
We investigate set constraints over set expressions with Tarskian functional and relational operations. Unlike the Herbrand constructor symbols used in recent set constraint formalisms, the meaning of a Tarskian function symbol is interpreted in an arbitrary first order structure. We show that satisfiability of Tarskian set constraints is decidable in nondeterministic doubly exponential time. W...
متن کامل